SherbyNet - /page/wikibook/entry.mu

<!DOCTYPE html>

<title>Simulation-based optimization</title>

</head>

Simulation-based optimization

</h1>

</header>

<div id="mw-content-text" class="mw-body-content mw-content-ltr" lang="en" dir="ltr"><div class="mw-content-ltr mw-parser-output" lang="en" dir="ltr">Simulation-based optimization (also known as simply simulation optimization) integrates <a href="Optimization_(mathematics)" class="mw-redirect" title="Optimization (mathematics)">optimization</a> techniques into <a href="Computer_simulation" title="Computer simulation">simulation</a> modeling and analysis. Because of the complexity of the simulation, the <a href="Objective_function" class="mw-redirect" title="Objective function">objective function</a> may become difficult and expensive to evaluate. Usually, the underlying simulation model is stochastic, so that the objective function must be estimated using statistical estimation techniques (called output analysis in simulation methodology).

Once a system is mathematically modeled, computer-based simulations provide information about its behavior. Parametric simulation methods can be used to improve the performance of a system. In this method, the input of each variable is varied with other parameters remaining constant and the effect on the design objective is observed. This is a time-consuming method and improves the performance partially. To obtain the optimal solution with minimum computation and time, the problem is solved iteratively where in each iteration the solution moves closer to the optimum solution. Such methods are known as ‘numerical optimization’, ‘simulation-based optimization’<a href="#cite_note-1">[1]</a> or 'simulation-based multi-objective optimization' used when more than one objective is involved.

In simulation experiment, the goal is to evaluate the effect of different values of input variables on a system. However, the interest is sometimes in finding the optimal value for input variables in terms of the system outcomes. One way could be running simulation experiments for all possible input variables. However, this approach is not always practical due to several possible situations and it just makes it intractable to run experiments for each scenario. For example, there might be too many possible values for input variables, or the simulation model might be too complicated and expensive to run for a large set of input variable values. In these cases, the goal is to iterative find optimal values for the input variables rather than trying all possible values. This process is called simulation optimization.<a href="#cite_note-2">[2]</a>

Specific simulation–based optimization methods can be chosen according to Figure 1 based on the decision variable types.<a href="#cite_note-3">[3]</a>

<a href="Optimization_(computer_science)" class="mw-redirect" title="Optimization (computer science)">Optimization</a> exists in two main branches of operations research:

Optimization <a href="Parametric_programming" title="Parametric programming">parametric</a> (static) – The objective is to find the values of the parameters, which are “static” for all states, with the goal of maximizing or minimizing a function. In this case, one can use <a href="Mathematical_programming" class="mw-redirect" title="Mathematical programming">mathematical programming</a>, such as <a href="Linear_programming" title="Linear programming">linear programming</a>. In this scenario, simulation helps when the parameters contain noise or the evaluation of the problem would demand excessive computer time, due to its complexity.<a href="#cite_note-:0-4">[4]</a>

Optimization <a href="Optimal_control" title="Optimal control">control</a> (dynamic) – This is used largely in <a href="Computer_science" title="Computer science">computer science</a> and <a href="Electrical_engineering" title="Electrical engineering">electrical engineering</a>. The optimal control is per state and the results change in each of them. One can use mathematical programming, as well as dynamic programming. In this scenario, simulation can generate random samples and solve complex and large-scale problems.<a href="#cite_note-:0-4">[4]</a>

<div class="mw-heading mw-heading2"><h2 id="Simulation-based_optimization_methods">Simulation-based optimization methods</h2></div>

Some important approaches in simulation optimization are discussed below.

<div class="mw-heading mw-heading3"><h3 id="Statistical_ranking_and_selection_methods_(R/S)">Statistical ranking and selection methods (R/S)</h3></div>

Ranking and selection methods are designed for problems where the alternatives are fixed and known, and simulation is used to estimate the system performance.

In the simulation optimization setting, applicable methods include indifference zone approaches, optimal computing budget allocation, and knowledge gradient algorithms.

<div class="mw-heading mw-heading3"><h3 id="Response_surface_methodology_(RSM)">Response surface methodology (RSM)</h3></div>

In <a href="Response_surface_methodology" title="Response surface methodology">response surface methodology</a>, the objective is to find the relationship between the input variables and the response variables. The process starts from trying to fit a linear regression model. If the P-value turns out to be low, then a higher degree polynomial regression, which is usually quadratic, will be implemented. The process of finding a good relationship between input and response variables will be done for each simulation test. In simulation optimization, response surface method can be used to find the best input variables that produce desired outcomes in terms of response variables.<a href="#cite_note-7">[7]</a>

<div class="mw-heading mw-heading3"><h3 id="Heuristic_methods">Heuristic methods</h3></div>

<a href="Heuristic_(computer_science)" title="Heuristic (computer science)">Heuristic methods</a> change accuracy by speed. Their goal is to find a good solution faster than the traditional methods, when they are too slow or fail in solving the problem. Usually they find local optimal instead of the optimal value; however, the values are considered close enough of the final solution. Examples of these kinds of methods include <a href="Tabu_search" title="Tabu search">tabu search</a> and <a href="Genetic_algorithms" class="mw-redirect" title="Genetic algorithms">genetic algorithms</a>.<a href="#cite_note-:0-4">[4]</a>

Metamodels enable researchers to obtain reliable approximate model outputs without running expensive and time-consuming computer simulations. Therefore, the process of model optimization can take less computation time and cost.<a href="#cite_note-8">[8]</a>

<div class="mw-heading mw-heading3"><h3 id="Stochastic_approximation">Stochastic approximation</h3></div>

<a href="Stochastic_approximation" title="Stochastic approximation">Stochastic approximation</a> is used when the function cannot be computed directly, only estimated via noisy observations. In these scenarios, this method (or family of methods) looks for the extrema of these function. The objective function would be:<a href="#cite_note-9">[9]</a>

<mrow>

</mrow>

</mrow>

</munder>

</mrow>

</mrow>

</mrow>

</mrow>

<mrow>

</mrow>

</mrow>

</munder>

</mrow>

</mrow>

</mrow>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle {\underset {{\text{x}}\in \theta }{\min }}f{\bigl (}{\text{x}}{\bigr )}={\underset {{\text{x}}\in \theta }{\min }}\mathrm {E} [F{\bigl (}{\text{x,y}})]}</annotation>

</semantics>

</math><img src="./04377c9d3671d9fd84e77dccf51a61d6e750124a.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.171ex; width:25.174ex; height:4.343ex;" alt="{\displaystyle {\underset {{\text{x}}\in \theta }{\min }}f{\bigl (}{\text{x}}{\bigr )}={\underset {{\text{x}}\in \theta }{\min }}\mathrm {E} [F{\bigl (}{\text{x,y}})]}" loading="lazy"></dd></dl>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle y}</annotation>

</semantics>

</math><img src="./b8a6208ec717213d4317e666f1ae872e00620a0d.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:1.155ex; height:2.009ex;" alt="{\displaystyle y}" loading="lazy"> is a random variable that represents the noise.</dd></dl>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle x}</annotation>

</semantics>

</math><img src="./87f9e315fd7e2ba406057a97300593c4802b53e4.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.33ex; height:1.676ex;" alt="{\displaystyle x}" loading="lazy"> is the parameter that minimizes <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle f{\bigl (}{\text{x}}{\bigr )}}">

</mrow>

</mrow>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle f{\bigl (}{\text{x}}{\bigr )}}</annotation>

</semantics>

</math><img src="./f816c678d8052e2b49b17131f43000468baf434b.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -1.005ex; width:4.636ex; height:3.176ex;" alt="{\displaystyle f{\bigl (}{\text{x}}{\bigr )}}" loading="lazy">.</dd></dl>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle \theta }</annotation>

</semantics>

</math><img src="./6e5ab2664b422d53eb0c7df3b87e1360d75ad9af.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.09ex; height:2.176ex;" alt="{\displaystyle \theta }" loading="lazy"> is the domain of the parameter <math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle x}">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle x}</annotation>

</semantics>

</math><img src="./87f9e315fd7e2ba406057a97300593c4802b53e4.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.33ex; height:1.676ex;" alt="{\displaystyle x}" loading="lazy">.</dd></dl>

<div class="mw-heading mw-heading3"><h3 id="Derivative-free_optimization_methods">Derivative-free optimization methods</h3></div>

<a href="Derivative-free_optimization" title="Derivative-free optimization">Derivative-free optimization</a> is a subject of mathematical optimization. This method is applied to a certain optimization problem when its derivatives are unavailable or unreliable. Derivative-free methods establish a model based on sample function values or directly draw a sample set of function values without exploiting a detailed model. Since it needs no derivatives, it cannot be compared to derivative-based methods.<a href="#cite_note-10">[10]</a>

For unconstrained optimization problems, it has the form:

<mrow>

</mrow>

<msup>

</mrow>

</mrow>

</msup>

</mrow>

</munder>

</mrow>

</mrow>

</mrow>

</mrow>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle {\underset {{\text{x}}\in \mathbb {R} ^{n}}{\min }}f{\bigl (}{\text{x}}{\bigr )}}</annotation>

</semantics>

</math><img src="./d0d2d4b9e8f3fb0e5a9d61d4401f070fe2069bf8.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.171ex; width:8.752ex; height:4.343ex;" alt="{\displaystyle {\underset {{\text{x}}\in \mathbb {R} ^{n}}{\min }}f{\bigl (}{\text{x}}{\bigr )}}" loading="lazy"></dd></dl>

The limitations of derivative-free optimization:

1. Some methods cannot handle optimization problems with more than a few variables; the results are usually not so accurate. However, there are numerous practical cases where derivative-free methods have been successful in non-trivial simulation optimization problems that include randomness manifesting as "noise" in the objective function. See, for example, the following

.<a href="#cite_note-11">[11]</a>

2. When confronted with minimizing non-convex functions, it will show its limitation.

3. Derivative-free optimization methods are relatively simple and easy, but, like most optimization methods, some care is required in practical implementation (e.g., in choosing the algorithm parameters).

<div class="mw-heading mw-heading3"><h3 id="Dynamic_programming_and_neuro-dynamic_programming">Dynamic programming and neuro-dynamic programming</h3></div>

<div class="mw-heading mw-heading4"><h4 id="Dynamic_programming">Dynamic programming</h4></div>

<a href="Dynamic_programming" title="Dynamic programming">Dynamic programming</a> deals with situations where decisions are made in stages. The key to this kind of problem is to trade off the present and future costs.<a href="#cite_note-12">[12]</a>

One dynamic basic model has two features:

1) It has a discrete time dynamic system.

2) The cost function is additive over time.

For discrete features, dynamic programming has the form:

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle x_{k+1}=f_{k}(x_{k},u_{k},w_{k}),k=0,1,...,N-1}</annotation>

</semantics>

</math><img src="./378685c62aaaebe77efa1377f36905e9937db4af.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:41.251ex; height:2.843ex;" alt="{\displaystyle x_{k+1}=f_{k}(x_{k},u_{k},w_{k}),k=0,1,...,N-1}" loading="lazy"></dd></dl>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle k}</annotation>

</semantics>

</math><img src="./c3c9a2c7b599b37105512c5d570edc034056dd40.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.211ex; height:2.176ex;" alt="{\displaystyle k}" loading="lazy"> represents the index of discrete time.</dd></dl>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle x_{k}}</annotation>

</semantics>

</math><img src="./6d2b88c64c76a03611549fb9b4cf4ed060b56002.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.418ex; height:2.009ex;" alt="{\displaystyle x_{k}}" loading="lazy"> is the state of the time k, it contains the past information and prepares it for future optimization.</dd></dl>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle u_{k}}</annotation>

</semantics>

</math><img src="./9837644700489d04d977da272524cd5fda36f3d7.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.418ex; height:2.009ex;" alt="{\displaystyle u_{k}}" loading="lazy"> is the control variable.</dd></dl>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle w_{k}}</annotation>

</semantics>

</math><img src="./ac808de3e1f01ed40c69d4a350035b19ab28445f.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.671ex; width:2.753ex; height:2.009ex;" alt="{\displaystyle w_{k}}" loading="lazy"> is the random parameter.</dd></dl>

For the cost function, it has the form:

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</munderover>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle g_{N}(X_{N})+\sum _{k=0}^{N-1}g_{k}(x_{k},u_{k},W_{k})}</annotation>

</semantics>

</math><img src="./1fcf95ad79f848b7941ae40f171d3407347f2d0f.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -3.171ex; width:29.207ex; height:7.509ex;" alt="{\displaystyle g_{N}(X_{N})+\sum _{k=0}^{N-1}g_{k}(x_{k},u_{k},W_{k})}" loading="lazy"></dd></dl>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle g_{N}(X_{N})}</annotation>

</semantics>

</math><img src="./1bd7b37c957c777d856169e863ef24c7c0ee0e88.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:8.226ex; height:2.843ex;" alt="{\displaystyle g_{N}(X_{N})}" loading="lazy"> is the cost at the end of the process.

As the cost cannot be optimized meaningfully, it can be used the expect value:

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mrow>

</mrow>

</munderover>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

<msub>

</mrow>

</msub>

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle E\{g_{N}(X_{N})+\sum _{k=0}^{N-1}g_{k}(x_{k},u_{k},W_{k})\}}</annotation>

</semantics>

</math><img src="./a14fad9c4ebc8948b853c7ad1954da3f518a832e.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -3.171ex; width:33.307ex; height:7.509ex;" alt="{\displaystyle E\{g_{N}(X_{N})+\sum _{k=0}^{N-1}g_{k}(x_{k},u_{k},W_{k})\}}" loading="lazy"></dd></dl>

<div class="mw-heading mw-heading4"><h4 id="Neuro-dynamic_programming">Neuro-dynamic programming</h4></div>

Neuro-dynamic programming is the same as dynamic programming except that the former has the concept of approximation architectures. It combines <a href="Artificial_intelligence" title="Artificial intelligence">artificial intelligence</a>, simulation-base algorithms, and functional approach techniques. “Neuro” in this term origins from artificial intelligence community. It means learning how to make improved decisions for the future via built-in mechanism based on the current behavior. The most important part of neuro-dynamic programming is to build a trained neuro network for the optimal problem.<a href="#cite_note-13">[13]</a>

<div class="mw-heading mw-heading2"><h2 id="Limitations">Limitations</h2></div>

Simulation-based optimization has some limitations, such as the difficulty of creating a model that imitates the dynamic behavior of a system in a way that is considered good enough for its representation. Another problem is complexity in the determining uncontrollable parameters of both real-world system and simulation. Moreover, only a statistical estimation of real values can be obtained. It is not easy to determine the objective function, since it is a result of measurements, which can be harmful to the solutions.<a href="#cite_note-14">[14]</a><a href="#cite_note-15">[15]</a>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

<li id="cite_note-1"><a href="#cite_ref-1">^</a> Nguyen, Anh-Tuan, Sigrid Reiter, and Philippe Rigo. "<a rel="nofollow" class="external text" href="https://orbi.uliege.be/bitstream/2268/155988/1/Nguyen%20AT.pdf">A review on simulation-based optimization methods applied to building performance analysis</a>."Applied Energy 113 (2014): 1043–1058.

</li>

<li id="cite_note-2"><a href="#cite_ref-2">^</a> Carson, Yolanda, and Anu Maria. "<a rel="nofollow" class="external text" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.9192&rep=rep1&type=pdf">Simulation optimization: methods and applications</a>." Proceedings of the 29th Winter Simulation Conference. IEEE Computer Society, 1997.

</li>

<li id="cite_note-3"><a href="#cite_ref-3">^</a> Jalali, Hamed, and Inneke Van Nieuwenhuyse. "<a rel="nofollow" class="external text" href="https://core.ac.uk/download/pdf/34623919.pdf">Simulation optimization in inventory replenishment: a classification</a>." IIE Transactions 47.11 (2015): 1217-1235.

</li>

<li id="cite_note-:0-4">^ <a href="#cite_ref-:0_4-0">a</a> <a href="#cite_ref-:0_4-1">b</a> <a href="#cite_ref-:0_4-2">c</a> Abhijit Gosavi, <a rel="nofollow" class="external text" href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.462.5587&rep=rep1&type=pdf">Simulation‐Based Optimization: Parametric Optimization Techniques and Reinforcement Learning</a>, Springer, 2nd Edition (2015)

</li>

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFFu2015" class="citation book cs1">Fu, Michael, ed. (2015). <a rel="nofollow" class="external text" href="https://www.springer.com/us/book/9781493913831">Handbook of Simulation Optimization</a>. Springer.</cite>

</li>

<li id="cite_note-6"><a href="#cite_ref-6">^</a> Spall, J.C. (2003). Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control. Hoboken: Wiley.

</li>

<li id="cite_note-7"><a href="#cite_ref-7">^</a> Rahimi Mazrae Shahi, M., Fallah Mehdipour, E. and Amiri, M. (2016), <a rel="nofollow" class="external text" href="https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12150">Optimization using simulation and response surface methodology with an application on subway train scheduling</a>. Intl. Trans. in Op. Res., 23: 797–811. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1111%2Fitor.12150">10.1111/itor.12150</a>

</li>

<li id="cite_note-8"><a href="#cite_ref-8">^</a> <cite id="CITEREFYousefiYousefiFerreiraKim2018" class="citation journal cs1">Yousefi, Milad; Yousefi, Moslem; Ferreira, Ricardo Poley Martins; Kim, Joong Hoon; Fogliatto, Flavio S. (2018). "Chaotic genetic algorithm and Adaboost ensemble metamodeling approach for optimum resource planning in emergency departments". Artificial Intelligence in Medicine. 84: 23–33. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1016%2Fj.artmed.2017.10.002">10.1016/j.artmed.2017.10.002</a>. <a href="PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/29054572">29054572</a>.</cite>

</li>

<li id="cite_note-9"><a href="#cite_ref-9">^</a> Powell, W. (2011). Approximate Dynamic Programming Solving the Curses of Dimensionality (2nd ed., Wiley Series in Probability and Statistics). Hoboken: Wiley.

</li>

<li id="cite_note-10"><a href="#cite_ref-10">^</a> Conn, A. R.; <a href="Katya_Scheinberg" title="Katya Scheinberg">Scheinberg, K.</a>; <a href="Luis_Nunes_Vicente" title="Luis Nunes Vicente">Vicente, L. N.</a> (2009). <a rel="nofollow" class="external text" href="http://www.mat.uc.pt/~lnv/idfo/">Introduction to Derivative-Free Optimization</a>. MPS-SIAM Book Series on Optimization. Philadelphia: SIAM. Retrieved 2014-01-18.

</li>

<li id="cite_note-11"><a href="#cite_ref-11">^</a> Fu, M.C., Hill, S.D. Optimization of discrete event systems via simultaneous perturbation stochastic approximation. IIE Transactions 29, 233–243 (1997). <a rel="nofollow" class="external free" href="https://doi.org/10.1023/A:1018523313043">https://doi.org/10.1023/A:1018523313043</a>

</li>

<li id="cite_note-12"><a href="#cite_ref-12">^</a> Cooper, Leon; Cooper, Mary W. Introduction to dynamic programming. New York: Pergamon Press, 1981

</li>

<li id="cite_note-13"><a href="#cite_ref-13">^</a> Van Roy, B., Bertsekas, D., Lee, Y., & <a href="John_Tsitsiklis" title="John Tsitsiklis">Tsitsiklis, J.</a> (1997). <a rel="nofollow" class="external text" href="https://web.stanford.edu/~bvr/pubs/retail.pdf">Neuro-dynamic programming approach to retailer inventory management</a>. Proceedings of the IEEE Conference on Decision and Control, 4, 4052-4057.

</li>

<li id="cite_note-14"><a href="#cite_ref-14">^</a> Prasetio, Y. (2005). <a rel="nofollow" class="external text" href="https://elibrary.ru/item.asp?id=9387151">Simulation-based optimization for complex stochastic systems</a>. University of Washington.

</li>

<li id="cite_note-15"><a href="#cite_ref-15">^</a> Deng, G., & Ferris, Michael. (2007). Simulation-based Optimization, ProQuest Dissertations and Theses

</li>

</ol></div></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2024-06-19" href="https://en.wikipedia.org/wiki/?title=Simulation-based_optimization&oldid=1229958180">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>